A Calculus for Type Predicates and Type Coercion
نویسنده
چکیده
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the signature guarantees, while type coercion allows using terms of a more general type where the signature calls for a more special one. These operations are important e.g. in the specification and verification of object-oriented programs. We present a tableau calculus for this logic and prove its completeness.
منابع مشابه
Distinguishing between type-shifting and pragmatic inferencing
Although Complement Coercion has been systematically associated with computational cost, there remains a serious confound in the experimental evidence built up in previous studies. The confound arises from the fact that lexicosemantic differences within the set of verbs assumed to involve coercion have not been taken into consideration. From among the set of verbs that have been reported to exh...
متن کاملOn the Proper Role of Coercion in Semantic Typing
In this paper, we discuss the phenomenon of logical polysemy in natural language as ~ddressed by Gener-ative Lexicon Theory. We discuss generally the role of type and sortal coercion operations in the selnantics, and specifically the conditions on the application of coercion in aspectual predicates and other contexts. We reply to some recent discussion regarding the use of coercion in the gramm...
متن کاملUnder Consideration for Publication in J. Functional Programming Girard Translation and Logical Predicates
We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this paper can be read as a tutorial on this proof technique for reasoning about relations between type...
متن کاملMechanisms of Sense Extension in Verbs
In this paper, we examine some of the mechanisms at work which relate distinct senses of a predicate. Independent of whether one adopts a lumping or splitting approach to sense differentiation and granularity in word meaning, the issue of how senses relate to one another is relevant for both approaches. While we differentiate between the selection and the coercion of an argument by a predicate,...
متن کاملCoherent Coercion Abstraction with a step-indexed strong-reduction semantics
The usual notion of type coercions that witness subtyping relations between types is generalized to a more expressive notion of typing coercions that witness subsumption relations between typings, e.g. pairs composed of a typing environment and a type. This is more expressive and allows for a clearer separation of language constructs with and without computational content. This is illustrated o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005